Max-planck-institut F Ur Informatik on Extra Variables in (equational) Logic Programming
نویسنده
چکیده
Extra variables in a clause are variables which occur in the body but not in the head. It has been argued that extra variables are necessary and contribute to the expressive power of logic languages. In the rst part of this paper, we show that this is not true in general. For this purpose, we provide a simple syntactic transformation of each logic program into a logic program without extra variables. Moreover, we show a strong correspondence between the original and the transformed program with respect to the declarative and the operational semantics. In the second part of this paper, we use a similar technique to provide new completeness results for equational logic programs with extra variables. In equational logic programming it is well known that extra variables cause problems since narrowing, the standard operational semantics for equational logic programming, may become incomplete in the presence of extra variables. Since extra variables are useful from a programming point of view, we characterize new classes of equational logic programs with extra variables for which narrowing and particular narrowing strategies are complete. In particular, we show the completeness of narrowing strategies in the presence of nonterminating functions and extra variables in right-hand sides of rewrite rules.
منابع مشابه
Charakterisierung der Farbeigenschaften melanozytärer Hautveränderungen zur Unterstützung der Früherkennung des malignen Melanoms
Max-Planck-Institut f ur extraterrestrische Physik, Garching Department of Electrical Engineering, University of Sydney Institut f ur medizinische Statistik und Epidemiologie, TU M unchen Klinik und Poliklinik f ur Dermatologie der Universit at Regensburg Fachbereich Informatik/Mathematik, Fachhochschule M unchen Lehrstuhl f ur Theoretische Informatik und Grundlagen der KI, TU M unchen ...
متن کاملMax-planck-institut F Ur Informatik Middle-out Reasoning for Logic Program Synthesis K I N F O R M a T I K Im Stadtwald D 66123 Saarbr Ucken Germany Authors' Addresses
Logic programs can be synthesized as a by-product of the planning of their veri cation proofs. This is achieved by using higher-order variables at the proof planning level, which become instantiated in the course of planning. We illustrate two uses of such variables in proof planning for program synthesis, one for synthesis proper and one for the selection of induction schemes. We demonstrate t...
متن کاملMax-planck-institut F Ur Informatik Non-symmetric Rewriting Acknowledgements We Wish to Thank
Rewriting is traditionally presented as a method to compute normal forms in varieties. Conceptually, however, its essence are commutation properties. We develop rewriting as a general theory of commutation for two possibly non-symmetric transitive relations modulo a congruence and prove a generalization of the standard Church-Rosser theorem. The theorems of equational rewriting, including the e...
متن کاملMax-planck-institut F Ur Informatik an Abstract Program Generation Logic K I N F O R M a T I K Im Stadtwald D 66123 Saarbr Ucken Germany Authors' Addresses
We present a system for representing programs as proofs which combines features of classical and constructive logic We present the syntax semantics and inference rules of the system and establish soundness and consistency The system is based on an unspeci ed underlying logic possessing certain properties We show how proofs in this system can be systematically converted to programs in a class of...
متن کاملMax-planck-institut F Ur Informatik Linear 0 -1 Inequalities and Extended Clauses K I N F O R M a T I K Im Stadtwald D 66123 Saarbr Ucken Germany Author's Address
Extended clauses are the basic formulas of the 0-1 constraint solver for the constraint logic programming language CLP(PB). We present a method for transforming an arbitrary linear 0-1 inequality into a set of extended clauses, such that the solution space remains invariant. After applying well-known linearization techniques on non-linear 0-1 constraints followed by the presented transformation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994